Dual effect free stochastic controls
نویسندگان
چکیده
In stochastic optimal control, a key issue is the fact that “solutions” are searched for in terms of “feedback” over available information and, as a consequence, a major potential difficulty is the fact that present control may affect future available information. This is known as the “dual effect” of control. Given a minimal framework (that is, an observation mapping from the product of a control set and of a random set towards an observation set), we define open-loop lack of dual effect as the property that the information provided by observations under open-loop control laws is fixed, whatever the open-loop control. Our main result consists in characterizing the maximal set of closed-loop control laws for which the information provided by observations closed with such a feedback remains also fixed. We then address the multi-agent case. To obtain a comparable result, we are led to generalize the precedence and memory-communication binary relations introduced by Ho and Chu for the LQG problem, and to assume that the precedence relation is compatible with the memory-communication relation. When the precedence relation induces an acyclic graph, we prove that, when open-loop lack of dual effect holds, the maximal set of closed-loop control laws for which the information provided by observations closed with such a feedback remains fixed is the set of feedbacks measurable with respect to this fixed information. We end by studying the dual effect for discrete time stochastic input-output systems with dynamic information structure, for which the same result holds. Corresponding author: [email protected]
منابع مشابه
Distributed Asynchronous Dual-Free Stochastic Dual Coordinate Ascent
In this paper, we propose a new Distributed Asynchronous Dual-Free Coordinate Ascent method (dis-dfSDCA), and prove that it has linear convergence rate in convex case. Stochastic Dual Coordinate Ascent (SDCA) is a popular method in solving regularized convex loss minimization problems. Dual-Free Stochastic Dual Coordinate Ascent (dfSDCA) method is a variation of SDCA, and can be applied to a mo...
متن کاملA Two Stage Stochastic Programming Model of the Price Decision Problem in the Dual-channel Closed-loop Supply Chain
In this paper, we propose a new model for designing integrated forward/reverse logistics based on pricing policy in direct and indirect sales channel. The proposed model includes producers, disposal center, distributers and final customers. We assumed that the location of final customers is fixed. First, a deterministic mixed integer linear programming model is developed for integrated logistic...
متن کاملGeometric Programming with Stochastic Parameter
Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...
متن کاملMini-Batch Primal and Dual Methods for SVMs
We address the issue of using mini-batches in stochastic optimization of SVMs. We show that the same quantity, the spectral norm of the data, controls the parallelization speedup obtained for both primal stochastic subgradient descent (SGD) and stochastic dual coordinate ascent (SCDA) methods and use it to derive novel variants of mini-batched SDCA. Our guarantees for both methods are expressed...
متن کاملSeparated design of encoder and controller for networked linear quadratic optimal control
For a networked control system, we consider the problem of encoder and controller design. We study a discrete-time linear plant with a finite horizon performance cost, comprising of a quadratic function of the states and controls, and an additive communication cost. We study separation in design of the encoder and controller, along with related closed-loop properties such as the dual effect and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 142 شماره
صفحات -
تاریخ انتشار 2006